merge-two-sorted-lists

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given the heads of two sorted linked lists <code>list1</code> and <code>list2</code>.

Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/merge_ex1.jpg" style="width: 662px; height: 302px;" />
<pre>
Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]
</pre>

Example 2:

<pre>
Input: list1 = [], list2 = []
Output: []
</pre>

Example 3:

<pre>
Input: list1 = [], list2 = [0]
Output: [0]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in both lists is in the range <code>[0, 50]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
	<li>Both <code>list1</code> and <code>list2</code> are sorted in non-decreasing order.</li>
</ul>